Kazhdan–Lusztig polynomials and subexpressions
نویسندگان
چکیده
We refine an idea of Deodhar, whose goal is a counting formula for Kazhdan–Lusztig polynomials. This consequence simple observation that one can use the solution Soergel's conjecture to make ambiguities involved in defining certain morphisms between Soergel bimodules characteristic zero (double leaves) disappear.
منابع مشابه
Partitioning of Algebraic Subexpressions in Computer Algebra
A popular technique to direct transformations of algebraic expressions in a computer algebra system such as Macsyma/Maxima or Mathematica is to first write out a pattern or template for some expected class of “input” expressions and use a built-in system routine to match it, identifying pieces and giving them names, then proceeding to compute with these parts. Sometimes this is not such a good ...
متن کاملEliminating Common Subexpressions During Flattening
Many constraint models contain common subexpressions. Eliminating this redundancy has two key benefits, both of which contribute to a substantial reduction in solving time: a dramatic reduction in the size of the model, and enhanced constraint propagation leading to reduced search. Depending on the facilities offered by a particular constraint solver, flattening is required to tailor solver-ind...
متن کاملFree Variables and Subexpressions in Higher-Order Meta Logic
This paper addresses the problem of how to represent free variables and subexpressions involving-bindings. The aim is to apply what is known as higher-order abstract syntax to higher-order term rewriting systems. Directly applying-reduction for the purpose of subterm-replacement is incompatible with the requirements of term-rewriting. A new meta-level representation of subterms is developed tha...
متن کاملOptimizing Polynomial Expressions by Factoring and Eliminating Common Subexpressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities for optimization. However existing compiler techniques for reducing code complexity such as common subexpression elimination and value numbering are targeted towards general purpose applications and are unable to full...
متن کاملA new algorithm for elimination of common subexpressions
The problem of an efficient hardware implementation of multiplications with one or more constants is encountered in many different digital signal-processing areas, such as image processing or digital filter optimization. In a more general form, this is a problem of common subexpression elimination, and as such it also occurs in compiler optimization and many highlevel synthesis tasks. An effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2021
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2020.10.009